P-Median: A Performance Analysis
نویسندگان
چکیده
This work approaches the P-median problem with a partitioning around medoids methodology. This problem has been extensively studied because of the multiple applications and its NP-hard nature; therefore several are the efforts to find optimal solutions. In this paper we consider two case studies: 1) instances from OR-Library and 2) geographical objects from the metropolitan zone of Toluca, Mexico. The methods we use to work with these data are: Partitioning Around Medoids (PAM), Variable Neighborhood Search (VNS), Simulated Annealing (SA), P-Median with MATLAB (PML) and finally Tabu Search (TS).
منابع مشابه
PERFORMANCE COMPARISON OF CBO AND ECBO FOR LOCATION FINDING PROBLEMS
The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...
متن کاملComparison of The Effectiveness of Traditional and Post-Activation Potentiation Warm-Up Methods on EMG Variables of Selected Lower Limb Muscles During Squat Jump
Purpose: A proper warm-up method can be used as a strategy to improve performance of athletes in various sport fields. The aim of present study was to compare the effect of two traditional and post-activation potentiation warm-up methods on electromyographic variables of lower extremity muscles during squat jump. Methods: Fourteen trained male athletes were randomly performed three different p...
متن کاملImproved Adaptive Median Filter Algorithm for Removing Impulse Noise from Grayscale Images
Digital image is often degraded by many kinds of noise during the process of acquisition and transmission. To make subsequent processing more convenient, it is necessary to decrease the effect of noise. There are many kinds of noises in image, which mainly include salt and pepper noise and Gaussian noise. This paper focuses on median filters to remove the salt and pepper noise. After summarizin...
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملDominance in hands and cross-sectional area of median nerve in carpal tunnel syndrome
Introduction: Currently, neuroresearchers report that the median nerve shows severity-correlated intracarpal enlargement in idiopathic carpal tunnel syndrome (CTS) as a most common peripheral neuropathic disorder. The purpose of this paper was to investigate ultrasonography morphological findings in patients with idiopathic CTS and comparing some physical properties such as age, gender, BMI wit...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Research in Computing Science
دوره 88 شماره
صفحات -
تاریخ انتشار 2014